A Multilevel Tabu Search for the Maximum Satisfiability Problem
نویسندگان
چکیده
منابع مشابه
Tabu Search for the Maximum Diversity Problem
In this paper, we develop new heuristic procedures for the maximum diversity problem (MDP). This NPhard problem has a significant number of practical applications such as environmental balance, telecommunication services or genetic engineering. The proposed algorithm is based on the tabu search methodology and incorporates memory structures for both construction and improvement. Although propos...
متن کاملTabu search for the multilevel generalized assignment problem
The multilevel generalized assignment problem (MGAP) differs from the classical GAP in that agents can perform tasks at more than one efficiency level. Important manufacturing problems, such as lot sizing, can be formulated as MGAPs; however, the large number of variables in the related 0-1 integer program makes the use of commercial optimization packages impractical. In this paper, we present ...
متن کاملFrequency-driven tabu search for the maximum s-plex problem
The maximum s-plex problem is an important model for social network analysis and other studies. In this study, we present an effective frequency-driven multineighborhood tabu search algorithm (FD-TS) to solve the problem on very large networks. The proposed FD-TS algorithm relies on two transformation operators (Add and Swap) to locate high-quality solutions, and a frequency-driven perturbation...
متن کاملTabu search and GRASP for the maximum diversity problem
In this paper, we develop new heuristic procedures for the maximum diversity problem (MDP). This NP-hard problem has a significant number of practical applications such as environmental balance, telecommunication services or genetic engineering. The proposed algorithm is based on the tabu search methodology and incorporates memory structures for both construction and improvement. Although propo...
متن کاملTabu Search vs. GRASP for the Maximum Diversity Problem
The Maximum Diversity Problem (MDP) consists in determining a subset M of given cardinality from a set of elements N , in such a way that the sum of the pairwise distances between the elements of M is maximum. This problem, introduced by Glover [6], has been deeply studied using GRASP methodologies [5, 1, 13, 2]. GRASP is often characterized by a strong design effort dedicated to build high qua...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Communications, Network and System Sciences
سال: 2012
ISSN: 1913-3715,1913-3723
DOI: 10.4236/ijcns.2012.510068